A Hybrid Ant Colony Optimization(HACO) for Solving Capacitated Vehicle Routing Problem(CVRP)
نویسندگان
چکیده
The Capacitated Vehicle Routing Problem (CVRP) is a combinatorial optimization and nonlinear problem seeking to service a number of customers with a fleet of vehicles. CVRP is an important problem in the fields of transportation, distribution and logistics. Usually, the goal is delivering goods located at a central depot to customers who have placed orders. This transportation optimization problem is NP-hard, which means that the computational effort required to solve it increases exponentially with the problem size. To solve it in an acceptable time some stochastic algorithms are needed. Here we proposed the algorithm Hybrid Ant Colony Optimization(HACO) which takes the advantage of Simulated Annealing(SA) to solve CVRP
منابع مشابه
APPLICATION of HYBRID ANT COLONY OPTIMIZATION (HACO) AlGORITHM for SOLVING CAPACITATED VEHICLE ROUTING PROBLEM (CVRP)
The Capacitated Vehicle Routing problem (CVRP) is a combinatorial optimization and nonlinear problem seeking to service a number of customers with a fleet of vehicles. CVRP isan important problem in the fields of transportation, distribution and logistics . Usually, the goal is delivering goods located at a central depot to customers who have placed orders. This transportation optimization prob...
متن کاملSolving the Vehicle Routing Problem with Simultaneous Pickup and Delivery by an Effective Ant Colony Optimization
One of the most important extensions of the capacitated vehicle routing problem (CVRP) is the vehicle routing problem with simultaneous pickup and delivery (VRPSPD) where customers require simultaneous delivery and pick-up service. In this paper, we propose an effective ant colony optimization (EACO) which includes insert, swap and 2-Opt moves for solving VRPSPD that is different with common an...
متن کاملVehicle Routing Optimization in Logistics Distribution using Hybrid Ant Colony Algorithm
The Vehicle Routing Problem (VRP) is an important management problem in the field of physical distribution and logistics. Good vehicle routing can not only increase the profit of logistics but also make logistics management more scientific. The Capacitated Vehicle Routing Problem (CVRP) constrained by the capacity of a vehicle is the extension of VRP. Our research applies a two-phase algorithm ...
متن کاملAn Ant Colony Algorithm for the Capacitated Vehicle Routing
The Vehicle Routing Problem (VRP) requires the determination of an optimal set of routes for a set of vehicles to serve a set of customers. We deal here with the Capacitated Vehicle Routing Problem (CVRP) where there is a maximum weight or volume that each vehicle can load. We developed an Ant Colony algorithm (ACO) for the CVRP based on the metaheuristic technique introduced by Colorni, Dorigo...
متن کاملA Generalized Island Model Based on Parallel and Cooperating Metaheuristics for Effective Large Capacitated Vehicle Routing Problem Solving
Capacitated Vehicle Routing Problem (CVRP) is among transportation problems that are of the foremost concerns in logistics. Ensuring an effective product distribution over a large distribution network while reducing the required costs represents the scope of the present work. A synergic and interactive environment of parallel meta-heuristics is developed using a generalized island model to deal...
متن کامل